A simple bijection between a subclass of 2-binary trees and ternary treesPRODINGER, Helmut.Discrete mathematics. 2009, Vol 309, Num 4, pp 959-961, issn 0012-365X, 3 p.Article

Binary trees with the largest number of subtreesSZEKELY, L. A; HUA WANG.Discrete applied mathematics. 2007, Vol 155, Num 3, pp 374-385, issn 0166-218X, 12 p.Article

Détermination des gammes d'assemblage = Assembly plan generationPHAM, V.-H; MARTINEZ, M; FAVREL, J et al.Journal européen des systèmes automatisés. 1999, Vol 33, Num 1-2, pp 43-64, issn 1269-6935Article

On rotations and the generation of binary treesLUCAS, J. M; ROELANTS VAN BARONAIGIEN, D; RUSKEY, F et al.Journal of algorithms (Print). 1993, Vol 15, Num 3, pp 343-366, issn 0196-6774Article

Wiener indices of balanced binary treesBEREG, Sergey; HAO WANG.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-26032-3, 3Vol, part II, 851-859Conference Paper

YET ANOTHER GENERALIZATION OF POSTNIKOV'S HOOK LENGTH FORMULA FOR BINARY TREESHAN, Guo-Niu.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 2, pp 661-664, issn 0895-4801, 4 p.Article

Un efamille d'opérations sur les arbres binaires = A family of operations on binary treesBLONDEL, V.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1995, Vol 321, Num 4, pp 491-494, issn 0764-4442Article

Loop-free algorithms for traversing binary treesFENNER, T. I; LOIZOU, G.BIT (Nordisk Tidskrift for Informationsbehandling). 1984, Vol 24, Num 1, pp 33-44, issn 0006-3835Article

KP line solitons and Tamari latticesDIMAKIS, Aristophanes; MÜLLER-HOISSEN, Folkert.Journal of physics. A, Mathematical and theoretical (Print). 2011, Vol 44, Num 2, issn 1751-8113, 025203.1-025203.49Article

An improved bound on the maximum agreement subtree problemSTEEL, Mike; SZEKELY, Laszló A.Applied mathematics letters. 2009, Vol 22, Num 11, pp 1778-1780, issn 0893-9659, 3 p.Article

On the shrinkage exponent for read-once formulaeHASTAD, J; RAZBOROV, A; YAO, A et al.Theoretical computer science. 1995, Vol 141, Num 1-2, pp 269-282, issn 0304-3975Article

A Kleene-like characterization of languages accepted by systolic tree automataFACHINI, E; MONTI, A.Journal of computer and system sciences (Print). 1994, Vol 49, Num 1, pp 133-147, issn 0022-0000Article

A note on the Horton-Strahler number for random treesDEVROYE, L; KRUSZEWSKI, P.Information processing letters. 1994, Vol 52, Num 3, pp 155-159, issn 0020-0190Article

Embedding of complete binary trees into meshes with row-column routingLEE, S.-K; CHOI, H.-A.IEEE transactions on parallel and distributed systems. 1996, Vol 7, Num 5, pp 493-497, issn 1045-9219Article

Edge-colouring pairs of Binary trees: Towards a concise proof of the four-colour theorem of planar mapsGIBBONS, Alan; SANT, Paul.Lecture notes in computer science. 2002, pp 25-39, issn 0302-9743, isbn 3-540-44040-2, 15 p.Conference Paper

An efficient upper bound of the rotation distance of binary treesPALLO, J.Information processing letters. 2000, Vol 73, Num 3-4, pp 87-92, issn 0020-0190Article

Dynamic reconfiguration of complete binary trees in faulty hypercubesCHEN, Chui-Cheng.Journal of information science and engineering. 2005, Vol 21, Num 1, pp 195-207, issn 1016-2364, 13 p.Article

On the generation of binary trees in A-orderAHRABIAN, H; NOWZARI-DALINI, A.International journal of computer mathematics. 1999, Vol 71, Num 3, pp 351-357, issn 0020-7160Article

A distributed expansible authentication model based on KerberosHONGJUN LIU; PING LUO; DAOSHUN WANG et al.Journal of network and computer applications. 2008, Vol 31, Num 4, pp 472-486, issn 1084-8045, 15 p.Article

On the number of t-ary trees with a given path lengthSEROUSSI, Gadiel.Algorithmica. 2006, Vol 46, Num 3-4, pp 557-565, issn 0178-4617, 9 p.Conference Paper

An efficient strategy for storing and searching binary trees in WORM external memoryDUARTE, Elias P; PIRES, Karine; TAVARES, Rui A. E et al.Journal of information science. 2010, Vol 36, Num 6, pp 751-762, issn 0165-5515, 12 p.Article

Computing the quartet distance between trees of arbitrary degreeCHRISTIANSEN, Chris; MAILUND, Thomas; PEDERSEN, Christian N. S et al.Lecture notes in computer science. 2005, pp 77-88, issn 0302-9743, isbn 3-540-29008-7, 1Vol, 12 p.Conference Paper

Binary trees and uniform distribution of traffic cutbackLI, S.-Y. R.Journal of computer and system sciences (Print). 1986, Vol 32, Num 1, pp 1-14, issn 0022-0000Article

Generating binary trees using rotationsZERLING, D.Journal of the Association for Computing Machinery. 1985, Vol 32, Num 3, pp 694-701, issn 0004-5411Article

A probabilistic analysis of the height of tries and of the complexity of triesortDEVROYE, L.Acta informatica. 1984, Vol 21, Num 3, pp 229-237, issn 0001-5903Article